Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2009, Vol. 32 ›› Issue (3): 50-54.doi: 10.13190/jbupt.200903.50.dengzhx

• Papers • Previous Articles     Next Articles

PN Code Acquisition Sum-Product Algorithm and Performance Analysis Based on Tanner Graph

  

  • Received:2008-10-29 Revised:2009-02-12 Online:2009-06-28 Published:2009-06-28

Abstract:

To solve the problem of long acquisition time of routine PN code acquisition algorithm, a PN code iterative acquisition algorithm based on Tanner graph is proposed. The Tanner graph show of PN code and the sum-product algorithm process on the graph are presented. The performance of iterative acquisition algorithm is analyzed by simulation and the sum-product algorithm is modified. The simulation results show that when the signal-noise ratio is not very low, the bit-error rate of the APP estimation will convergence to zero.

Key words: Tanner graph, sum-product algorithm, PN code, iterative acquisition